
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1621. -- [Usaco2008 Open]Roads Around The Farm -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1621: [Usaco2008 Open]Roads Around The Farm</h2><span class=green>Time Limit: </span>5 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>260&nbsp;&nbsp;<span class=green>Solved: </span>188<br>[<a href='submitpage.php?id=1621'>Submit</a>][<a href='problemstatus.php?id=1621'>Status</a>][<a href='bbs.php?id=1621'>Discuss</a>]</center><h2>Description</h2><div class=content>Farmer John's cows have taken an interest in exploring the territory
around the farm. Initially, all N (1 <= N <= 1,000,000,000) cows
commence traveling down a road in one big group. Upon encountering
a fork in the road, the group sometimes chooses to break into two
smaller (nonempty) groups with each group continuing down one of
the roads.  When one of those groups arrives at another fork, it
might split again, and so on.

The cows have crafted a peculiar way of splitting: if they can split
into two groups such that the sizes of the groups differ by exactly
K (1 <= K <= 1000), then they will split in that way; otherwise,
they stop exploring and just start grazing peacefully.

Assuming that there will always be new forks in the road, compute
the final number of groups of peacefully grazing cows.
N个牛走路,遇到分叉,如果能分成人数之差为K的两堆,则分头行进.
否则就不走了.问最多分成几个块.
</div><h2>Input</h2><div class=content>* Line 1: Two space-separated integers: N and K

</div><h2>Output</h2><div class=content>* Line 1: A single integer representing the number of groups of
        grazing cows

</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>6 2<br />
<br />
INPUT DETAILS:<br />
<br />
There are 6 cows and the difference in group sizes is 2.<br />
<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>3<br />
<br />
OUTPUT DETAILS:<br />
<br />
There are 3 final groups (with 2, 1, and 3 cows in them).<br />
<br />
   6<br />
  / \<br />
 2   4<br />
    / \<br />
   1   3<br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Silver'>Silver</a></p></div><center>[<a href='submitpage.php?id=1621'>Submit</a>][<a href='problemstatus.php?id=1621'>Status</a>][<a href='bbs.php?id=1621'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
